Papers with end-to-end tasks
Reliable Use of Lemmas via Eligibility Reasoning and Section-Aware Reinforcement Learning (2026.acl-short)
Copied to clipboard
| Challenge: | Recent large language models (LLMs) perform strongly on mathematical benchmarks but often import conclusions without validating assumptions. |
| Approach: | They propose a model that encodes a lemma specification and trains with reinforcement learning and section-aware loss masking to assign penalty to the section responsible for errors. |
| Outcome: | The proposed model performs well on benchmarks but often misapplyes lemmas . the model is able to encode the specification and train with reinforcement learning . |
Ask Me Anything in Your Native Language (2022.naacl-main)
Copied to clipboard
| Challenge: | Cross-lingual question answering systems are becoming more and more important . a new approach can be generalized to more than 20 languages and outperforms previous models by 12% . |
| Approach: | They propose a cross-lingual question answering system that can be generalized to more than 20 languages . their approach can outperform previous models by 12% on multiple languages based on a dataset . |
| Outcome: | The proposed approach outperforms the previous models on multiple languages by 12% . it can be generalized to more than 20 languages and outperformed all previous models by 2% . |
BayesFlow: A Probability Inference Framework for Meta-Agent Assisted Workflow Generation (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have demonstrated remarkable generality, often solving tasks with a single carefully engineered prompt. |
| Approach: | They propose to cast automatic workflow generation as Bayesian inference over a posterior distribution on workflows and instantiate BayesFlow as Bayer-based workflow generation framework. |
| Outcome: | The proposed framework improves accuracy by 9 percentage points over baselines and 65 percentage points on pool-wide benchmarks. |
Beyond Word Boundaries: A Hebrew Coreference Benchmark and an Evaluation Protocol for Morphologically Complex Text (2026.acl-long)
Copied to clipboard
| Challenge: | CR methods originally designed for English struggle with Morphologically Rich Languages (MRLs) a single token in Hebrew may consist of multiple anaphors, and word/morpheme boundary discrepancies make mention detection and coreference resolution difficult in MRLs. |
| Approach: | They propose a CR dataset that identifies mentions at word, sub-word and multi-word levels and an evaluation protocol that directly addresses word/morpheme boundary discrepancies. |
| Outcome: | The proposed evaluation protocol directly addresses word/morpheme boundary discrepancies in Modern Hebrew, an MRL rich with complex words and pronominal clitics. |